Polynomial Relations between Polynomial Roots
نویسندگان
چکیده
منابع مشابه
Linear Relations between Polynomial Orbits
We study the orbits of a polynomial f ∈ C[X], namely the sets {α, f(α), f(f(α)), . . . } with α ∈ C. We prove that if two nonlinear complex polynomials f, g have orbits with infinite intersection, then f and g have a common iterate. More generally, we describe the intersection of any line in C with a d-tuple of orbits of nonlinear polynomials, and we formulate a question which generalizes both ...
متن کاملOn the Roots of Hosoya Polynomial of a Graph
Let G = (V, E) be a simple graph. Hosoya polynomial of G is d(u,v) H(G, x) = {u,v}V(G)x , where, d(u ,v) denotes the distance between vertices u and v. As is the case with other graph polynomials, such as chromatic, independence and domination polynomial, it is natural to study the roots of Hosoya polynomial of a graph. In this paper we study the roots of Hosoya polynomials of some specific g...
متن کاملLow-Degree Polynomial Roots
5 Cubic Polynomials 7 5.1 Real Roots of Multiplicity Larger Than One . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 5.2 One Simple Real Root . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 5.3 Three Simple Real Roots . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 5.4 A Mixed-Type Implementation . . . . . . . . . . . . ....
متن کاملNoncommutative Polynomial Relations
Terminology: We’ll say that two polynomials p, q are congruent, and write p ≡ q, if their equality is a consequence of our given relation. To be consistent, we also write the given relation as f ≡ 0. We must explain the consequences of f ≡ 0 specifically. They are that if u, v are any polynomials, then the product ufv is congruent to zero, as is a finite sum of such products. That is all. For i...
متن کاملPolynomial Roots: The Ultimate Answer?
We show that it is always possible to transform the problem of tìnding the mots of a generic polynomial to the problem of determining the eigenvalues of tridiagonal matrices having only simple eigenvalues. Since this problem is very effìciently solved, for example with the familiar QR method, it seems that the present veIy simple approach bas the potentiality to supplant the existing ones.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 1995
ISSN: 0021-8693
DOI: 10.1006/jabr.1995.1330